Synchronous consensus under hybrid process and link failures
نویسندگان
چکیده
منابع مشابه
Synchronous consensus under hybrid process and link failures☆
WE INTRODUCE A COMPREHENSIVE HYBRID FAILURE MODEL FOR SYNCHRONOUS DISTRIBUTED SYSTEMS, WHICH EXTENDS A CONVENTIONAL HYBRID PROCESS FAILURE MODEL BY ADDING COMMUNICATION FAILURES: Every process in the system is allowed to commit up to fℓs send link failures and experience up to fℓr receive link failures per round here, without being considered faulty; up to some fℓsa≤fℓs and fℓra≤fℓr among those...
متن کاملSynchronous Consensus for Dependent Process Failures
We present a new abstraction to replace the t of n assumption used in designing fault-tolerant algorithms. This abstraction models dependent process failures yet it is asion models dependent process failures yet it is as simple to use as the t of n assumption. To illustrate this abstraction, we consider Consensus for synchronous systems with both crash and arbitrary process failures. By conside...
متن کاملImpossibility Results and Lower Bounds for Consensus under Link Failures
We provide a suite of impossibility results and lower bounds for the required number of processes and rounds for synchronous consensus under transient link failures. Our results show that consensus can be solved even in presence of O(n) moving omission and/or arbitrary link failures per round, provided that both the number of affected outgoing and incoming links of every process is bounded. Pro...
متن کاملBooting Clock Synchronization in Partially Synchronous Systems with Hybrid Node and Link Failures
This paper provides description and analysis a new clock synchronization algorithm for partially synchronous systems with unknown upper and lower bounds on delays. Unlike existing solutions, it relies upon a hybrid failure model incorporating both process and link failures, in both time and value domain, and works during both system startup and normal operation: Whereas bounded precision (= mut...
متن کاملIterative Approximate Consensus in the Presence of Byzantine Link Failures
This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each directed link of the underlying communication graph represents a communication channel between a pair of nodes. We adopt the transient Byzantine link failure model [15, 16], where an omniscient adversary controls a subset of the directed communication links, but the nodes are ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.09.032